Ideal chains with fixed self-intersection rate

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group Isomorphism with Fixed Subnormal Chains

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed p-groups of order n could be tested in n 1 2 logp n+O(p) time, roughly a square root of the classical bound. The O(p) term is entirely due to an n cost of testing for isomorphisms that match fixed composition series in the two groups. We focus here on the fixed-composition-series subproblem and exhibit a polynomia...

متن کامل

Intersection and mixing times for reversible chains

Suppose X and Y are two independent irreducible Markov chains on n states. We consider the intersection time, which is the first time their trajectories intersect. We show for reversible and lazy chains that the total variation mixing time is always upper bounded by the expected intersection time taken over the worst starting states. For random walks on trees we show the two quantities are equi...

متن کامل

Modules with copure intersection property

In this paper, we investigate the modules with the copure intersection property and obtained obtain some related results.  

متن کامل

Quasi-symmetric 3-designs with a fixed block intersection number

Quasi-symmetric 3-designs with block intersection numbers x, y (0 ≤ x ≤ y < k) are studied. It is proved that the parameter λ of a quasi-symmetric 3-(v, k, λ) design satisfies a quadratic whose coefficients are polynomial functions of k, x and y. We use this quadratic to prove that there exist finitely many quasi-symmetric 3-designs under either of the following two restrictions: 1. The block i...

متن کامل

Intersection Graphs in Simultaneous Embedding with Fixed Edges

We examine the simultaneous embedding with fixed edges problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a simultaneous embedding with fixed edges for (G1, G2). More formally, we define the subset ISEFE of all planar graphs as follows: A graph S lies in ISEFE if every pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2011

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.84.051104